Solving vertex coloring problems as maximum weight stable set problems
نویسندگان
چکیده
منابع مشابه
Solving Vertex Coloring Problems as Maximum Weight Stable Set Problems
In Vertex Coloring Problems, one is required to assign a color to each vertex of an undirected graph in such a way that adjacent vertices receive different colors, and the objective is to minimize the cost of the used colors. In this work we solve four different coloring problems formulated as Maximum Weight Stable Set Problems on an associated graph. We exploit the transformation proposed by C...
متن کاملSolving Vertex Coloring Problems as Maximum Weighted Stable Set Problems
In Vertex Coloring Problems, one is required to assign a color to each vertex of an undirected graph in such a way that adjacent vertices receive different colors, and the objective is to minimize the cost of the used colors. In this work we solve four different coloring problems formulated as Maximum Weight Stable Set Problems on an associated graph. We exploit the transformation proposed by C...
متن کاملA survey on vertex coloring problems
This paper surveys the most important algorithmic and computational results on the Vertex Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the classical models for the VCP, and discusses how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem. Computational results on the best performing algorithms pro...
متن کاملApproximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
Unit disk graphs are the intersection graphs of equal sized circles in the plane. In this paper, we consider the maximum independent set problems on unit disk graphs. When the given unit disk graph is de ned on a slab whose width is k, we propose an algorithm for nding a maximum independent set in O(n 4 d 2k= p 3 e ) time where n denotes the number of vertices. We also propose a (1 1=r)-approxi...
متن کاملSolving stable matching problems using answer set programming
Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for finding the stable matchings. To address this issue, we propose an encoding of the SMP using answer set programming (ASP), which can straightforwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.09.018